A New Multiobjective Evolutionary Algorithm: OMOEA

نویسندگان

  • SanYou Zeng
  • Yuping Chen
  • LiXin Ding
  • LiShan Kang
چکیده

A new algorithm is proposed to solve constrained multi-objective problems in this paper. The constraints of the MOPs are taken account of in determining Pareto dominance. As a result, the feasibility of solutions is not an issue. At the same time, it takes advantage of both the orthogonal design method to search evenly, and the statistical optimal method to speed up the computation. The output of the technique is a large set of solutions with high precision and even distribution. Notably, for an engineering problem WATER, it finds the Pareto-optimal set, which was previously unknown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Pareto-based Cost Simulated Annealing for Multiobjective Optimization

In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...

متن کامل

A new multiobjective evolutionary algorithm

The Pareto-based approaches have shown some success in designing multiobjective evolutionary algorithms. Their methods of fitness assignment are mainly from the information of dominated and nondominated individuals. On the top of the hierarchy of multiobjective evolutionary algorithms, the Strength Pareto Evolutionary Algorithm (SPEA) has been elaborately designed with this principle in mind. I...

متن کامل

Multiobjective Cloud Particle Optimization Algorithm Based on Decomposition

Abstract: The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has received attention from researchers in recent years. This paper presents a new multiobjective algorithm based on decomposition and the cloud model called multiobjective decomposition evolutionary algorithm based on Cloud Particle Differential Evolution (MOEA/D-CPDE). In the proposed method, the best solution...

متن کامل

Multiobjective Prototype Optimization with Evolved Improvement Steps

Recently, a new iterative optimization framework utilizing an evolutionary algorithm called ”Prototype Optimization with Evolved iMprovement Steps” (POEMS) was introduced, which showed good performance on hard optimization problems large instances of TSP and real-valued optimization problems. Especially, on discrete optimization problems such as the TSP the algorithm exhibited much better searc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005